A Comparison of Methods for Solving MAX-SAT Problems
نویسندگان
چکیده
We compare the performance of 3 approaches to the solution of MAX-SAT problems, including a version of the DavisPutnam-Loveland algorithm extended to solve MAX-SAT, an integer programming branch-and-cut algorithm and an algorithm for MAX-2-SAT problems based on a semide nite programming relation.
منابع مشابه
Solving MAX-XOR-SAT Problems with Stochastic Local Search
The MAX-SAT problem is to find a truth assignment that satisfies the maximum number of clauses in a finite set of logical clauses. In the special case of MAX-XOR-SAT, arising from Linear Cryptanalysis, each clause is a set of literals joined by exclusive-or (xor). Solving MAX-XOR-SAT is useful in finding keys to decrypt intercepted encrypted messages. This report presents and evaluates Xor-Walk...
متن کاملSolving Over-Constrained Problems with SAT
We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clauses and distinguish between hard and soft blocks. We then present two Max-SAT-based solvers for our formalism and an experimental investigation.
متن کاملSolving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis
We analyze, in this work, the performance of a recently introduced weighted Max-SAT solver, Clone, in the Max-SAT evaluation 2007. Clone utilizes a novel bound computation based on formula compilation that allows it to search in a reduced search space. We study how additional techniques from the SAT and Max-SAT literature affect the performance of Clone on problems from the evaluation. We then ...
متن کاملSolving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We wanted to see how recent progress in the weighted CSP (WCSP) field could compete with other approaches in related fields. One of these fields is propositional logic and the well-known Max-SAT problem. In this paper, we...
متن کاملLearning Hard Constraints in Max-SAT⋆
Solving over-constrained problems with Max-SAT solvers typically consists of finding an assignment that satisfies all the hard constraints and the maximum number of soft constraints. Despite the relevance of clause learning in SAT for solving structured instances, this technology has not yet been extended to Max-SAT. In this paper, we have incorporated a module that learns hard clauses in a bra...
متن کامل